New convergence results on the generalized Richardson extrapolation process GREP for logarithmic sequences

approximations A (j) n to A obtained via GREP(1) are defined by the linear systems a(tl) = A (j) n + φ(tl) ∑n−1 i=0 β̄it i l , l = j, j + 1, . . . , j + n, where {tl}l=0 is a decreasing positive sequence with limit zero. The study of GREP(1) for slowly varying functions a(t) was begun in two recent papers by the author. For such a(t) we have φ(t) ∼ αtδ as t → 0+ with δ possibly complex and δ 6= 0,−1,−2, . . . . In the present work we continue to study the convergence and stability of GREP(1) as it is applied to such a(t) with different sets of collocation points tl that have been used in practical situations. In particular, we consider the cases in which (i) tl are arbitrary, (ii) liml→∞ tl+1/tl = 1, (iii) tl ∼ cl−q as l → ∞ for some c, q > 0, (iv) tl+1/tl ≤ ω ∈ (0, 1) for all l, (v) liml→∞ tl+1/tl = ω ∈ (0, 1), and (vi) tl+1/tl = ω ∈ (0, 1) for all l.